A distributed methodology for approximate uniform global minimum sharing

The paper deals with the distributed minimum sharing problem: a set of decision-makers compute some local quantities interest in and decentralized way by exchanging information through communication network. We propose an adjustable approximate solution which enjoys several properties crucial importance applications. In particular, proposed has good decentralization it is scalable that number variables does not grow size or topology Moreover, global uniform (both initial time conditions) asymptotic stability result provided towards steady state can be made arbitrarily close to sought minimum. Exact convergence recovered at price losing uniformity respect time.